منابع مشابه
Blocking Optimal Arborescences
The problem of covering minimum cost common bases of two matroids is NP-complete, even if the two matroids coincide, and the costs are all equal to 1. In this paper we show that the following special case is solvable in polynomial time: given a digraph D = (V,A) with a designated root node r ∈ V and arc-costs c : A → R, find a minimum cardinality subset H of the arc set A such that H intersects...
متن کاملBlocking Optimal k-Arborescences
Given a digraph D = (V,A) and a positive integer k, an arc set F ⊆ A is called a karborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from ...
متن کاملOPTIMAL DESIGN OF SHELLS WITH STEP-FUNCTION DISTRIBUTION OF THICKNESS
The paper is concerned with a methodology of optimal design of shells of minimum weight with strength, stability and strain constraints. Stress and strain state of the shell is determined by Galerkin method in the mixed finite element formulation within the geometrically nonlinear theory. The analysis of the effectiveness of different optimization algorithms to solve the set problem is given. T...
متن کاملMany-to-Many Matching Design∗
We study second-degree price discrimination in markets where the product traded by the monopolist is access to other agents. We derive necessary and suffi cient conditions for the welfareand the profit-maximizing mechanisms to employ a single network or a menu of non-exclusive networks. We characterize the optimal matching schedules under a wide range of preferences, derive implications for pri...
متن کاملa-Stratified CAT design with content blocking.
Content balancing is often required in the development and implementation of computerized adaptive tests (CATs). In the current study, we propose a modified a-stratified method, the a-stratified method with content blocking. As a further refinement of a-stratified CAT designs, the new method incorporates content specifications into item pool stratification. Simulation studies were conducted to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Statistics
سال: 2000
ISSN: 0090-5364
DOI: 10.1214/aos/1016218230